Further results regarding the degree Kirchhoff index of graphs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Further Results regarding the Degree Kirchhoff Index of Graphs

Let G be a connected graph with vertex set V.G/. The degree Kirchhoff index of G is defined as S .G/D P fu;vg V.G/ d.u/d.v/R.u;v/, where d.u/ is the degree of vertex u, and R.u;v/ denotes the resistance distance between vertices u and v. In this paper we obtain some upper and lower bounds for the degree Kirchhoff index of graphs. We also obtain some bounds for the Nordhaus-Gaddum-type result fo...

متن کامل

note on degree kirchhoff index of graphs

the degree kirchhoff index of a connected graph $g$ is defined as‎ ‎the sum of the terms $d_i,d_j,r_{ij}$ over all pairs of vertices‎, ‎where $d_i$ is the‎ ‎degree of the $i$-th vertex‎, ‎and $r_{ij}$ the resistance distance between the $i$-th and‎ ‎$j$-th vertex of $g$‎. ‎bounds for the degree kirchhoff index of the line and para-line‎ ‎graphs are determined‎. ‎the special case of regular grap...

متن کامل

Maximizing Kirchhoff index of unicyclic graphs with fixed maximum degree

The Kirchhoff index of a connected graph is the sum of resistance distances between all unordered pairs of vertices in the graph. Its considerable applications are found in a variety of fields. In this paper, we determine the maximum value of Kirchhoff index among the unicyclic graphs with fixed number of vertices and maximum degree, and characterize the corresponding extremal graph.

متن کامل

Further Results on Betweenness Centrality of Graphs

Betweenness centrality is a distance-based invariant of graphs. In this paper, we use lexicographic product to compute betweenness centrality of some important classes of graphs. Finally, we pose some open problems related to this topic.

متن کامل

Computing the additive degree-Kirchhoff index with the Laplacian matrix

For any simple connected undirected graph, it is well known that the Kirchhoff and multiplicative degree-Kirchhoff indices can be computed using the Laplacian matrix. We show that the same is true for the additive degree-Kirchhoff index and give a compact Matlab program that computes all three Kirchhoffian indices with the Laplacian matrix as the only input.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Miskolc Mathematical Notes

سال: 2014

ISSN: 1787-2405,1787-2413

DOI: 10.18514/mmn.2014.781